A Logical Analysis of Boolean Constraints
نویسنده
چکیده
In Apt (1998) we provided a proof theoretic account of constraint programming. Here we show how it can be used to analyse Boolean constraints. More precisely, we show here how a Boolean constraint solver based on the look-ahead search strategy can be defined in a purely logical way. To this end we characterize arc consistency for Boolean constraints by proof theoretic means. As a byproduct we clarify the status of the proof rules introduced in Codognet & Diaz (1996) that form a basis of their Boolean constraint solver. These considerations lead to a simple Boolean constraint solver that generates all solutions to a given set of Boolean constraints. It performs well on various benchmarks.
منابع مشابه
132 Pre - Boolean Algebra , Ordered Dsmt and Dsm Continuous Models
When implementing the DSmT, a difficulty may arise from the possible huge dimension of hyper-power sets, which are indeed free structures. However, it is possible to reduce the dimension of these structures by involving logical constraints. In this chapter, the logical constraints will be related to a predefined order over the logical propositions. The use of such orders and their resulting log...
متن کاملMultimodal Triggers for Automated Filtering and Reactivity Based on Www Content
We describe a multimodal analysis based automated triggering mechanism for automated filtering and reactivity based on the content of multiple multimedia channels over the World Wide Web. The trigger description language supports complex conditions connected through Boolean operators (logical OR, logical AND, and negation), temporal and frequency of occurrence constraints and actions. A trigger...
متن کاملA SAT-based approach to decipher Gene Regulatory Networks
Computer tools are needed in systems biology to analyse qualitatively the dynamics of Gene Regulatory Networks (GRNs). Particularly, biologists are interested in infering these networks from observed behaviours. In this paper we present a Boolean satisfiability (SAT) approach applied on a widely used asynchronous logical description of such networks. After a brief presentation of the asynchrono...
متن کاملA SAT-Based Decision Procedure for Mixed Logical/Integer Linear Problems
In this paper, we present a method for solving Mixed Logical/Integer Linear Programming (MLILP) problems that integrates a polynomial-time ILP solver for the special class of Unit-Two-VariablePer-Inequality (unit TVPI or UTVPI) constraints of the form , where , into generic Boolean SAT solvers. In our approach the linear constraints are viewed as special literals and replaced by binary “indicat...
متن کاملQuantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints
We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boolean algebras of sets, this is a new generalization of Boole’s well-known variable elimination method for conjunctions of Boolean equality constraints. We also explain the connection of this new logical result with the evaluati...
متن کامل